Improved Fault Tolerant Elastic Scheduling Algorithm (IFESTAL)
نویسنده
چکیده
The existing fault tolerant models focus on the failure of host. If a host fails, the copies of tasks on this host will fail to finish. At one time instant, at most one host may encounter a failure, that is to say, if the primaries of tasks fail, the backups can always finish successfully before another host fails. Failures can be either transient or permanent, and are independent, affecting only a single host. In this paper, an attempt will be made to propose an improved algorithm to tolerate multiple host failures which will be tested using guarantee ratio, hosts active time, ratio of task over host time. Keywords—fault tolerance, Guarantee Ratio, Hosts Active Time, primary backup model and Ratio of Task Time over Host Time —————————— ——————————
منابع مشابه
Improved Fault Tolerant Elastic Scheduling Algorithm for Cloud Computing
The paper focus on Fault Tolerance, a long standing problem in cloud computing by extending Primary Backup model to include cloud features such as virtualization and elasticity. Fault tolerance is a challenging work in Cloud Computing as virtual machines are the basic computing instances rather than hosts that enable virtual machines to migrate to other hosts. The on demand provisioning of reso...
متن کاملImproving the palbimm scheduling algorithm for fault tolerance in cloud computing
Cloud computing is the latest technology that involves distributed computation over the Internet. It meets the needs of users through sharing resources and using virtual technology. The workflow user applications refer to a set of tasks to be processed within the cloud environment. Scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...
متن کاملIMLFQ Scheduling Algorithm with Combinational Fault Tolerant Method
Scheduling algorithms are used in operating systems to optimize the usage of processors. One of the most efficient algorithms for scheduling is Multi-Layer Feedback Queue (MLFQ) algorithm which uses several queues with different quanta. The most important weakness of this method is the inability to define the optimized the number of the queues and quantum of each queue. This weakness has been i...
متن کاملAn Efficient Fault Tolerant Scheduling Approach for Computational Grid
Grid computing serves as an important technology to facilitate distributed computation computational grids solve large scale scientific problems using heterogeneous geographically distributed resources. Problems like dispatching and scheduling of tasks are considered as major issues in computational grid environment. The Grid Scheduler must select proper resources for executing the tasks with l...
متن کاملPerformance Evaluation of Integrated Fault-Tolerant Technique: Simulation Study
In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-l...
متن کامل